Bipartite subgraphs of integer weighted graphs
نویسندگان
چکیده
منابع مشابه
Bipartite subgraphs of integer weighted graphs
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f( ( n 2 ) + m) = b 2 4 c + min(d n 2 e, f(m)). This supplies the precise value of f(p) for many values of p including, e.g, all p = ( n 2 ) + ( m 2 ) when n is large enough and m 2 4 ≤ n 2 .
متن کاملMaximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
We study the node-deletion problem consisting of finding a maximum weighted induced bipartite subgraph of a planar graph with maximum degree three. We show that this is polynomially solvable. It was shown in [4] that it is NP-complete if the maximum degree is four. We also extend these ideas to the problem of balancing signed graphs. We also consider maximum weighted induced acyclic subgraphs o...
متن کاملoptimal orientations of subgraphs of complete bipartite graphs
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
متن کاملDominating Bipartite Subgraphs in Graphs
A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.
متن کاملBipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n′ be the maximum number of vertices in an induced bipartite subgraph of G and let m′ be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G) = m′/m is called the bipartite density of G, and b∗(G) = n′/n is called the bipartite ratio of G. This paper proves that every 2connected triangle-free subcubic graph, apart fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00041-1